Graph-theoretic characterisations of structural controllability for multi-agent system with switching topologyy
نویسندگان
چکیده
This article considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems under switching topologies is investigated. The structural controllability of multi-agent systems is a generalisation of the traditional controllability concept for dynamical systems, and purely based on the communication topologies among agents. The main contributions of this article are graph-theoretic characterisations of the structural controllability for multi-agent systems. It turns out that the multi-agent system with switching topology is structurally controllable if and only if the union graph G of the underlying communication topologies is connected (single leader) or leader–follower connected (multi-leader). Finally, this article concludes with several illustrative examples and discussions of the results and future work.
منابع مشابه
Graph-theoretic characterisations of structural controllability for multi-agent system with switching topology
This paper considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems under switching topologies is investigated. The structural controllability of multi-agent systems is a generalization of the traditional controllability concept for dynamical systems, and purely based on the communication topologies among agents. The mai...
متن کاملStructural Controllability of Multi-Agent Networks: Robustness against Simultaneous Failures
In this paper, structural controllability of a leader-follower multi-agent system with multiple leaders is studied from a graph-theoretic point of view. The problem of preservation of structural controllability under simultaneous failures in both the communication links and the agents is investigated. The effects of the loss of agents and communication links on the controllability of an informa...
متن کاملControllability of Multi-Agent Systems from a Graph-Theoretic Perspective
In this work, we consider the controlled agreement problem for multi-agent networks, where a collection of agents take on leader roles while the remaining agents execute local, consensus-like protocols. Our aim is to identify reflections of graph-theoretic notions on systemtheoretic properties of such systems. In particular, we show how the symmetry structure of the network, characterized in te...
متن کاملControllability of multi-agent systems with time-delay in state and switching topology
In this article, the controllability issue is addressed for an interconnected system of multiple agents. The network associated with the system is of the leader–follower structure with some agents taking leader role and others being followers interconnected via the neighbour-based rule. Sufficient conditions are derived for the controllability of multi-agent systems with time-delay in state, as...
متن کاملControllability analysis of multi-agent systems with directed and weighted interconnection
In this article, we investigate the controllability of multi-agent systems with leaders as control inputs, where the interconnection is directed and weighted. We employ weight-balanced partition to classify the interconnection graphs, and study the controllable subspaces with given nontrivial weight-balanced partition. We also provide two necessary and sufficient graph conditions on structural ...
متن کامل